Polynomial-Time Computable Backup Tables for Shortest-Path Routing
نویسندگان
چکیده
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers from any single link-failure immediately after the failure occurs. It is shown that this scheme always works if the network is given as a two-edge-connected symmetric digraph and that an optimal backup table can be computed in time O V E . Furthermore, this time complexity can be reduced to linear if all edges of the graph have the same cost.
منابع مشابه
A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملSingle backup table schemes for shortest-path routing
We introduce a new recovery scheme that needs only one extra backup routing table for networks employing shortest-path routing. By precomputing this backup table, the network recovers from any single link failure immediately after the failure occurs. To compute the backup routing table for this scheme, we use an almost linear time algorithm to solve the {r, v}-problem, which is a variation of t...
متن کاملCompact Routing for Graphs Excluding a Fixed Minor
This paper concerns compact routing schemes with arbitrary node names. We present a compact name-independent routing scheme for unweighted networks with n nodes excluding a fixed minor. For any fixed minor, the scheme, constructible in polynomial time, has constant stretch factor and requires routing tables with poly-logarithmic number of bits at each node. For shortest-path labeled routing sch...
متن کاملThe Compactness of Interval Routing for Almost All Graphs
Interval routing is a compact way of representing routing tables on a graph. It is based on grouping together, in each node, destination addresses that use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show that almost all the graphs, i.e., a fraction of at least 1 − 1/n2 of all the n-node graphs, support a sh...
متن کاملCompact routing schemes with low stretch factor
This paper presents a routing strategy called Pivot Interval Routing (PIR), which allows message routing on every weighted n-node network along paths whose stretch factor (namely, the ratio between the length of the routing path and the shortest path) is at most five, and whose average stretch factor is at most three, with routing tables of size O( √ n log3/2 n) bits per node. In addition, the ...
متن کامل